Search | Engineering

订阅投稿

首页工程期刊工程焦点工程成就工程前沿关于我们 English

资源类型

期刊论文 203

会议视频 3

年份

2023 17

2022 13

2021 8

2020 13

2019 11

2018 10

2017 11

2016 4

2015 8

2014 4

2013 4

2012 6

2011 8

2010 13

2009 17

2008 15

2007 7

2006 5

2005 6

2004 2

展开︾

关键词

人工智能 4

优化 2

图神经网络 2

建模 2

跨海大桥 2

CFD 1

CPLEX 1

CP）；符号间干扰（inter symbol interference， ISI）；载波间干扰（inter carrier interference 1

DNA计算 1

GC-Q-TOFMS 1

HY-2卫星 1

ICI）；最大似然估计（maximum likelihood estimation 1

KD技术标准 1

KD挑战性问题 1

KD核心问题 1

KD猜想 1

K平均聚类 1

LC-Q-TOFMS 1

MCDB 1

展开︾

检索范围：

排序：展示方式：

Negative weights in network time model

Zoltán A. VATTAI, Levente MÁLYUSZ

《工程管理前沿（英文）》 2022年第9卷第2期页码 268-280 doi: 10.1007/s42524-020-0109-1

摘要： Time does not go backward. A negative duration, such as “time period” at first sight is difficult to interpret. Previous network techniques (CPM/PERT/PDM) did not support negative parameters and/or loops (potentially necessitating recursive calculations) in the model because of the limited computing and data storage capabilities of early computers. Monsieur Roy and John Fondahl implicitly introduced negative weights into network techniques to represent activities with fixed or estimated durations (MPM/PDM). Subsequently, the introduction of negative lead and/or lag times by software developers (IBM) apparently overcome the limitation of not allowing negative time parameters in time model. Referring to general digraph (Event on Node) representation where activities are represented by pairs of nodes and pairwise relative time restrictions are represented by weighted arrows, we can release most restraints in constructing the graph structure (incorporating the dynamic model of the inner logic of time plan), and a surprisingly flexible and handy network model can be developed that provides all the advantages of the abovementioned techniques. This paper aims to review the theoretical possibilities and technical interpretations (and use) of negative weights in network time models and discuss approximately 20 types of time-based restrictions among the activities of construction projects. We focus on pure relative time models, without considering other restrictions (such as calendar data, time-cost trade-off, resource allocation or other constraints).

关键词： graph technique network technique construction management scheduling

HTML PDF 收藏

Classifying multiclass relationships between ASes using graph convolutional network

《工程管理前沿（英文）》页码 653-667 doi: 10.1007/s42524-022-0217-1

摘要： Precisely understanding the business relationships between autonomous systems (ASes) is essential for studying the Internet structure. To date, many inference algorithms, which mainly focus on peer-to-peer (P2P) and provider-to-customer (P2C) binary classification, have been proposed to classify the AS relationships and have achieved excellent results. However, business-based sibling relationships and structure-based exchange relationships have become an increasingly nonnegligible part of the Internet market in recent years. Existing algorithms are often difficult to infer due to the high similarity of these relationships to P2P or P2C relationships. In this study, we focus on multiclassification of AS relationship for the first time. We first summarize the differences between AS relationships under the structural and attribute features, and the reasons why multiclass relationships are difficult to be inferred. We then introduce new features and propose a graph convolutional network (GCN) framework, AS-GCN, to solve this multiclassification problem under complex scenes. The proposed framework considers the global network structure and local link features concurrently. Experiments on real Internet topological data validate the effectiveness of our method, that is, AS-GCN. The proposed method achieves comparable results on the binary classification task and outperforms a series of baselines on the more difficult multiclassification task, with an overall metrics above 95%.

关键词： autonomous system multiclass relationship graph convolutional network classification algorithm Internet topology

HTML PDF 收藏

大规模图计算系统综述 Review

Ning LIU, Dong-sheng LI, Yi-ming ZHANG, Xiong-lve LI

《信息与电子工程前沿（英文）》 2020年第21卷第3期页码 384-404 doi: 10.1631/FITEE.1900127

摘要：图是描述实体之间关系的一种重要数据结构。现实世界中许多应用领域非常依赖图数据。然而，由于图计算应用与传统应用的显著差异，利用通用平台处理图计算应用是低效的，这极大推动了专用图计算系统的研究。本综述系统地对图算法和图计算应用进行分类，将现有图计算系统划分为通用和专用系统，并详细总结。深入分析图计算系统的实现技术，包括编程模型、分区策略、通信模型、执行模型和容错机制。最后，分析图计算领域最新进展，并提出有待进一步研究的4个问题。

关键词：图算法；图计算应用；图计算系统

HTML PDF 收藏

Detecting large-scale underwater cracks based on remote operated vehicle and graph convolutional neural

Wenxuan CAO; Junjie LI

《结构与土木工程前沿（英文）》 2022年第16卷第11期页码 1378-1396 doi: 10.1007/s11709-022-0855-8

摘要： It is of great significance to quickly detect underwater cracks as they can seriously threaten the safety of underwater structures. Research to date has mainly focused on the detection of above-water-level cracks and hasn’t considered the large scale cracks. In this paper, a large-scale underwater crack examination method is proposed based on image stitching and segmentation. In addition, a purpose of this paper is to design a new convolution method to segment underwater images. An improved As-Projective-As-Possible (APAP) algorithm was designed to extract and stitch keyframes from videos. The graph convolutional neural network (GCN) was used to segment the stitched image. The GCN’s m-IOU is 24.02% higher than Fully convolutional networks (FCN), proving that GCN has great potential of application in image segmentation and underwater image processing. The result shows that the improved APAP algorithm and GCN can adapt to complex underwater environments and perform well in different study areas.

关键词： underwater cracks remote operated vehicle image stitching image segmentation graph convolutional neural network

HTML PDF 收藏

Distributed coordination inmulti-agent systems: a graph Laplacian perspective

Zhi-min HAN,Zhi-yun LIN,Min-yue FU,Zhi-yong CHEN

《信息与电子工程前沿（英文）》 2015年第16卷第6期页码 429-448 doi: 10.1631/FITEE.1500118

摘要： This paper reviews some main results and progress in distributed multi-agent coordination from a graph Laplacian perspective. Distributed multi-agent coordination has been a very active subject studied extensively by the systems and control community in last decades, including distributed consensus, formation control, sensor localization, distributed optimization, etc. The aim of this paper is to provide both a comprehensive survey of existing literature in distributed multi-agent coordination and a new perspective in terms of graph Laplacian to categorize the fundamental mechanisms for distributed coordination. For different types of graph Laplacians, we summarize their inherent coordination features and specific research issues. This paper also highlights several promising research directions along with some open problems that are deemed important for future study.

关键词： Multi-agent systems Distributed coordination Graph Laplacian

HTML PDF 收藏

Efficacy of intelligent diagnosis with a dynamic uncertain causality graph model for rare disorders of

Dongping Ning, Zhan Zhang, Kun Qiu, Lin Lu, Qin Zhang, Yan Zhu, Renzhi Wang

《医学前沿（英文）》 2020年第14卷第4期页码 498-505 doi: 10.1007/s11684-020-0791-8

摘要： Disorders of sex development (DSD) are a group of rare complex clinical syndromes with multiple etiologies. Distinguishing the various causes of DSD is quite difficult in clinical practice, even for senior general physicians because of the similar and atypical clinical manifestations of these conditions. In addition, DSD are difficult to diagnose because most primary doctors receive insufficient training for DSD. Delayed diagnoses and misdiagnoses are common for patients with DSD and lead to poor treatment and prognoses. On the basis of the principles and algorithms of dynamic uncertain causality graph (DUCG), a diagnosis model for DSD was jointly constructed by experts on DSD and engineers of artificial intelligence. “Chaining” inference algorithm and weighted logic operation mechanism were applied to guarantee the accuracy and efficiency of diagnostic reasoning under incomplete situations and uncertain information. Verification was performed using 153 selected clinical cases involving nine common DSD-related diseases and three causes other than DSD as the differential diagnosis. The model had an accuracy of 94.1%, which was significantly higher than that of interns and third-year residents. In conclusion, the DUCG model has broad application prospects as a computer-aided diagnostic tool for DSD-related diseases.

关键词： disorders of sex development (DSD) intelligent diagnosis dynamic uncertain causality graph

HTML PDF 收藏

一种构建网络安全知识图谱的实用方法 Article

贾焰, 亓玉璐, 尚怀军, 江荣, 李爱平

《工程（英文）》 2018年第4卷第1期页码 53-60 doi: 10.1016/j.eng.2018.01.004

摘要：

网络攻击的形式复杂多变，检测和预测这些动态类型的攻击是一项充满挑战的任务。在当前的许多领域中，对于知识图谱的研究已经非常成熟。目前，有学者提出将知识图谱的概念与网络安全结合在一起来构建网络安全知识库，这是一件非常有意义的工作。基于这种理念，本文提出了一个构建网络安全知识图谱的方法和基于五元组模型的推演规则。本文使用机器学习的方法来抽取实体，然后构建本体，从而构建网络安全知识库。在构建网络安全知识库的过程中，使用Stanford NER 来训练提取器，然后利用提取器抽取所需的相关信息。本文提出的推演规则是基于五元组模型的，新的属性是通过计算公式推导得到的，新的关系是基于路径排序算法，同样是通过计算公式推导得到的。

关键词：网络安全知识图谱知识推演

HTML PDF 收藏

General modeling and optimization technique for real-world earth observation satellite scheduling

《工程管理前沿（英文）》页码 695-709 doi: 10.1007/s42524-023-0263-3

摘要： Over the last two decades, many modeling and optimization techniques have been developed for earth observation satellite (EOS) scheduling problems, but few of them show good generality to be engineered in real-world applications. This study proposes a general modeling and optimization technique for common and real-world EOS scheduling cases; it includes a decoupled framework, a general modeling method, and an easy-to-use algorithm library. In this technique, a framework that decouples the modeling, constraints, and optimization of EOS scheduling problems is built. With this framework, the EOS scheduling problems are appropriately modeled in a general manner, where the executable opportunity, another format of the well-known visible time window per EOS operation, is viewed as a selectable resource to be optimized. On this basis, 10 types of optimization algorithms, such as Tabu search and genetic algorithm, and a parallel competitive memetic algorithm, are developed. For simplified EOS scheduling problems, the proposed technique shows better performance in applicability and effectiveness than the state-of-the-art algorithms. In addition, a complicatedly constrained real-world benchmark exampled by a four-EOS Chinese commercial constellation is provided, and the technique is qualified and outperforms the in-use scheduling system by more than 50%.

关键词： earth observation satellite scheduling general technique optimization algorithm commercial constellation real-world benchmark

HTML PDF 收藏

Erratum to: Soft-HGRNs: soft hierarchical graph recurrent networks for multi-agent partially observable

Yixiang REN, Zhenhui YE, Yining CHEN, Xiaohong JIANG, Guanghua SONG

《信息与电子工程前沿（英文）》 2023年第24卷第3期页码 480-480 doi: 10.1631/FITEE.22e0073

HTML PDF 收藏

基于探针图的并行型图顶点着色DNA计算模型 Article

许进, 强小利, 张凯, 张成, 杨静

《工程（英文）》 2018年第4卷第1期页码 61-77 doi: 10.1016/j.eng.2018.02.011

摘要：

目前DNA 计算机研究中遇到的最大瓶颈是解空间指数爆炸问题，即随着问题规模的增大，所需要作为信息处理“数据”的DNA分子呈指数级增大。本文提出了一种新颖的图顶点着色DNA计算模型，该模型正是围绕着如何克服解空间指数爆炸问题以及如何提高运行速度而设计的。其主要贡献有：①通过如下三种方法来克服解空间指数爆炸问题：顶点颜色集的确定方法；子图分解方法以及子图中的顶点优化排序方法；②设计了一种并行型聚合酶链反应（PCR）操作技术，应用这种技术一次可以对图中多条边来删除非解，使得生物操作次数大大减少，极大地提高了运行速度。本文以一个3-着色的61 个顶点的图为例，实验表明，99% 的非可行解在构建初始解空间时就被删除，并利用DNA 自组装和并行PCR 方法，通过识别、拼接以及组装等技术得到解。由于该模型对任意61 个顶点的图是同样的操作方法，这就意味着，该模型的搜索能力可以达到O(359)。

关键词： DNA计算图顶点着色问题聚合酶链反应（PCR）

HTML PDF 收藏

图引导正则最小化的随机超梯度的交替方向方法 None

Qiang LAN, Lin-bo QIAO, Yi-jie WANG

《信息与电子工程前沿（英文）》 2018年第19卷第6期页码 755-762 doi: 10.1631/FITEE.1601771

摘要：提出并比较额外梯度交替方向的几种随机变体方法，称为带拉格朗日函数（SEGL）的随机超梯度交替方向法和带增广拉格朗日函数（SEGAL）的随机超梯度交替方向法。这些方法由两个大规模凸目标函数组成，可最小化图形引导的优化问题。机器学习中一些重要应用遵循图导引优化公式等作为线性回归、逻辑回归、Lasso结构化扩展以及结构化正则化逻辑回归的原则。通过融合逻辑回归和图形引导正则化回归，在几类数据集上进行了试验。试验结果表明所提算法优于其他竞争算法，且在实际应用中，SEGAL比SEGL性能更好。

关键词：随机优化；图形引导最小化；超梯度法；融合逻辑回归；图导向正则化逻辑回归

HTML PDF 收藏

连锁故障中电力系统脆弱性的多图卷积网络分析 Research Article

Supaporn LONAPALAWONG1,陈长胜2,王灿3,陈为1

《信息与电子工程前沿（英文）》 2022年第23卷第12期页码 1848-1861 doi: 10.1631/FITEE.2200035

摘要：分析电力系统在连锁故障中的薄弱环节是电力系统分析领域极具挑战的难题。电力系统领域的传统分析方法虽能发现一些简单的传播规律，但却难以捕捉不同运行条件下的复杂细节。近年来的研究引入了深度学习算法来解决这一难题。然而，现有基于深度学习的方法大多仅从拓扑层面考虑电力系统的网架结构，未能充分考虑空间信息（如电距离）以提高图卷积过程的精确度。鉴于此，本文提出一种新型电力系统加权线图，综合考虑电力系统拓扑结构和空间信息，大幅优化线图的边权分配。此外，本文提出一种基于图分类任务的多图卷积网络（MGCN），在保留电力系统空间相关性的同时有效捕获物理元件之间的关联。经验证，该模型能够在具有额外拓扑特征的建模系统中保持理想精度，从而更好地分析存在并行输电线路的复杂连锁故障。最后，本文采用逐层相关传播方法解释MGCN，并量化了模型分类的贡献因子，有效提升模型的可解释性。

关键词：电力系统；脆弱性；连锁故障；多图卷积网络；加权线图

HTML PDF 收藏

Erratum to: Efficient keyword search over graph-structured data based on minimal covered Erratum

Asieh Ghanbarpour, Abbas Niknafs, Hassan Naderi,naderi@iust.ac.ir

《信息与电子工程前沿（英文）》 2020年第21卷第6期页码 809-962 doi: 10.1631/FITEE.18e0133

摘要： Unfortunately the second author’s name has been misspelt. It should be read: Abbas NIKNAFS.

HTML PDF 收藏

构建我国农业信息化技术支持体系的探讨

郭书普,张立平,沈基长,董伟

《中国工程科学》 2005年第7卷第9期页码 89-94

摘要：

阐述了农业信息化的基本特征，介绍了农业信息化技术支持体系的发展现状，分析了存在的问题，指出现阶段加快农业信息技术体系建设应当重点抓好农业信息贮藏技术的研究、农业信息应用技术的开发、农业信息传播网络的建设。

关键词：农业信息化技术支持体系信息贮藏技术信息应用技术信息传播网络

HTML PDF 收藏

论文演化图：学术文献多视角结构化检索 None

Dan-ping LIAO, Yun-tao QIAN

《信息与电子工程前沿（英文）》 2019年第20卷第2期页码 187-205 doi: 10.1631/FITEE.1700105

摘要：学术文献检索关注于选取最可能符合用户信息需求的论文。目前大部分检索系统局限于输出相关文献列表，而这些检出文献相互独立。本文旨在揭示检索结果的相互关系。提出一种为学术文献建立结构化检索结果的方法，称为论文演化图（PEG）。PEG采用多个演化链描述查询输入信息在不同主题方向的演化情况。通过论文作者、参考文献引用、论文内容信息这3个视角，PEG能够发现文献之间各种潜在关系，并多视角展示文献演化过程。该文献检索系统支持关键词、单篇论文、双论文3种查询方式。PEG构造主要有3个步骤：首先，采用元图分解法把文献软聚合为多个群落，获取每篇论文的主题分布；其次，从与查询相关的文献群落中提取主题连贯性演化链。每条演化链反映查询信息的某一视角；最后，提取的演化链组合形成论文演化图，可以覆盖查询涉及的所有主题。基于真实文献数据库的实验结果表明，该方法能够建立对用户有意义的论文演化图。

关键词：论文演化图；学术文献检索；元图分解；主题连贯性

HTML PDF 收藏

标题作者时间类型操作

Negative weights in network time model

Zoltán A. VATTAI, Levente MÁLYUSZ

期刊论文

Classifying multiclass relationships between ASes using graph convolutional network

期刊论文

大规模图计算系统综述

Ning LIU, Dong-sheng LI, Yi-ming ZHANG, Xiong-lve LI

期刊论文

Detecting large-scale underwater cracks based on remote operated vehicle and graph convolutional neural